Martin-Löf random points satisfy Birkhoff’s ergodic theorem for effectively closed sets
نویسندگان
چکیده
منابع مشابه
A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
We prove the effective version of Birkhoff’s ergodic theorem for Martin-Löf random points and effectively open sets, improving the results previously obtained in this direction (in particular those of V. Vyugin, Nandakumar and Hoyrup, Rojas). The proof consists of two steps. First, we prove a generalization of Kučera’s theorem, which is a particular case of effective ergodic theorem: a trajecto...
متن کاملMartin-LöF Randomness in Spaces of Closed Sets
Algorithmic randomness was originally defined for Cantor space with the fair-coin measure. Recent work has examined algorithmic randomness in new contexts, in particular closed subsets of 2ω ([2] and [8]). In this paper we use the probability theory of closed set-valued random variables (RACS) to extend the definition of Martin-Löf randomness to spaces of closed subsets of locally compact, Haus...
متن کاملOn semimeasures predicting Martin-Löf random sequences
Solomonoff’s central result on induction is that the prediction of a universal semimeasureM converges rapidly and with probability 1 to the true sequence generating predictor μ, if the latter is computable. Hence, M is eligible as a universal sequence predictor in case of unknown μ. Despite some nearby results and proofs in the literature, the stronger result of convergence for all (Martin-Löf)...
متن کاملMartin-Löf random generalized Poisson processes
Martin-Löf randomness was originally defined and studied in the context of the Cantor space 2ω . In [1] probability theoretic random closed sets (RACS) are used as the foundation for the study of Martin-Löf randomness in spaces of closed sets. Here we focus on the space of closed subsets of R and a particular family of measures on this space, the generalized Poisson processes. This gives a nove...
متن کاملπ11-Martin-Löf random reals as measures of natural open sets
We elaborate a recursive-theoretic method to define real numbers which are random to any jump of the halting problem. This is obtained by generalizing a result of V. Becher and G. Chaitin dealing with the class of cofinite sets. As in the work of V. Becher and S. Grigorieff (but this time in the context of open sets in Cantor space) appeal to completeness phenomena replaces machine arguments. M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2012
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-2012-11179-7